Stochastic Reachability: From Markov Chains to Stochastic Hybrid Systems
نویسنده
چکیده
Stochastic hybrid systems represent established classes of realistic models of hybrid dynamics subject to random perturbations, autonomous uncontrollable transitions, nondeterminism or uncertainty. Stochastic reachability analysis is a key factor in the verification and deployment of stochastic hybrid systems. In this paper, we tackle the stochastic reachability problem from a purely probabilistic perspective. Using the connection between stochastic reachability and optimal stopping, the reach probabilities are estimated using only the probabilistic parameters (transition probabilities, infinitesimal generator) of stochastic hybrid systems. The technique is illustrated first for Markov chains, then for other more complex Markov models.
منابع مشابه
Reachability Analysis and its Application to the Safety Assessment of Autonomous Cars
This thesis is about the safety verification of dynamical systems using reachability analysis. Novel solutions have been developed for three major problem classes: Classical reachability analysis, stochastic reachability analysis, and their application to the safety assessment of autonomous cars. Classical reachability analysis aims to compute the exact or over-approximative set of states that ...
متن کاملExtended Stochastic Hybrid Systems and Their Reachability Problem
In this paper we generalize a model for stochastic hybrid systems. First, we prove that this model is a right Markov process and it satisfies some mathematical properties. Second, we propose a method based on the theory of Dirichlet forms to study the reachability problem associated with these systems.
متن کاملApproximate Abstractions of Stochastic Hybrid Systems
This paper considers the issue of developing approximate abstractions of stochastic hybrid systems. The stochastic continuous behaviour breaks many essential properties of hybrid automata. Our approach departs from the progress in stochastic reachability analysis and Markov chain approximations. For this purpose we have to introduce a new approximation scheme and look for a suitable metric. We ...
متن کاملAnalysing Decisive Stochastic Processes
In 2007, Abdulla et al. introduced the elegant concept of decisive Markov chain. Intuitively, decisiveness allows one to lift the good properties of finite Markov chains to infinite Markov chains. For instance, the approximate quantitative reachability problem can be solved for decisive Markov chains (enjoying reasonable effectiveness assumptions) including probabilistic lossy channel systems a...
متن کاملComputational Techniques for Reachability Analysis of Partially Observable Discrete Time Stochastic Hybrid Systems
Reachability analysis of hybrid systems has been used as a safety verification tool to assess offline whether the state of a system is capable of remaining within a designated safe region for a given time horizon. Although it has been applied to stochastic hybrid systems, little work has been done on the equally important problem of reachability under incomplete or noisy measurements of the sta...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011